Simple odd number frequency divider with 50% duty cycle

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple odd number frequency divider with 50% duty cycle

A simple odd number frequency divider with 50% duty cycle is presented. The odd number frequency divider consists of a general odd number counter and the proposed duty cycle trimming circuit. The duty cycle trimming circuit can output 50% duty cycle with only additional six transistors. A prototype divide-by-5 circuit with 50% duty cycle was implemented for a 500-Mb/s ∼ 5.6-Gb/s 1:10 CDR/DEMUX ...

متن کامل

The Multicolour Ramsey Number of a Long Odd Cycle

For a graph G, the k-colour Ramsey number Rk(G) is the least integer N such that every k-colouring of the edges of the complete graph KN contains a monochromatic copy of G. Bondy and Erdős conjectured that for an odd cycle Cn on n > 3 vertices, Rk(Cn) = 2 k−1(n− 1) + 1. This is known to hold when k = 2 and n > 3, and when k = 3 and n is large. We show that this conjecture holds asymptotically f...

متن کامل

Frequency & duty cycle control considerations for soft-switching buck chopper

This paper presents considerations on the switching frequency and duty cycle & operating equations of softswitching BUCK chopper. These considerations are discussed and applied to selected soft-switching families such as ZVS-QRC, ZCS-QRC, ZVS-QSW-CV, ZCS-QSWCC, ZVT-PWM and ZCT-PWM [1]. The limitations on switching frequency and duty cycle are derived in terms of: chopper input voltage (Vg), cho...

متن کامل

Graphs with k odd cycle lengths

Gyarfas, A., Graphs with k odd cycle lengths, Discrete Mathematics 103 (1992) 41-48. 41 If G is a graph with k ~ 1 odd cycle lengths then each block of G is either K2k+Z or contains a vertex of degree at most 2k. As a consequence, the chromatic number of G is at most 2k + 2. For a graph G let L(G) denote the set of odd cycle lengths of G, i.e., L( G) = {2i + 1: G contains a cycle of length 2i +...

متن کامل

Cobounding Odd Cycle Colorings

We give a very short self-contained combinatorial proof of the Babson-Kozlov conjecture, by presenting a cochain whose coboundary is the desired power of the characteristic class.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Electronics Express

سال: 2012

ISSN: 1349-2543

DOI: 10.1587/elex.9.1249